منابع مشابه
Classification and Identification of Telugu Handwritten Characters Extracted from Palm Leaves Using Decision Tree Approach
Research in character recognition is very popular for various application potentials in banks, post offices, defense organizations, reading aid for the blind, library automation, language processing and multi-media design. Even though Epigraphical work dealing with stone inscriptions have been analyzed, these have been done largely manually and also on 2D traces. A large collection of these are...
متن کاملHearing " palm tree " can hamper
Two picture-word interference experiments investigated effects from distractor words denoting objects that were visually similar to the target pictures (e.g., umbrella – palm tree) and effects from distractor words denoting objects that were from the same semantic category (e.g., drum – violin). In Experiment 1, participants were familiarized with pictures of the target objects and pictures o...
متن کاملMercury removal from aqueous solutions by palm leaves adsorbent
Mercury is a carcinogenic and teratogenic compound that tends to accumulate in water solutions. In this research, the removal of mercury from an aqueous solution was evaluated by using palm leaves. Experiments were performed to study the adsorption efficiency, the effect of the adsorbent amount, the balance time, the adsorbate concentration, and the pH on mercury removal. The experimental appar...
متن کاملFunctional Models for Regression Tree Leaves
This paper presents a study about functional models for regression tree leaves. We evaluate experimentally several alternatives to the averages commonly used in regression trees. We have implemented a regression tree learner (HTL) that is able to use several alternative models in the tree leaves. We study the effect on accuracy and the computational cost of these alternatives. The experiments c...
متن کاملOn a Spanning Tree with Specified Leaves
Let k ≥ 2 be an integer. We show that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| + 1, then for each subset S of V (G) with |S| = k, G has a spanning tree such that S is the set of endvertices. This result generalizes Ore’s theorem which guarantees the existence of a Hamilton path connecting any two vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Biogeography
سال: 2012
ISSN: 1948-6596
DOI: 10.21425/f5fbg12397